Extremal problems in logic programming and stable model computation

Extremal Problems in Logic Programming and Stable Model Computation

⊲ We study the following problem: given a class of logic programs C, determine the maximum number of stable models of a program from C. We establish the maximum for the class of all logic programs with at most n clauses, and for the class of all logic programs of size at most n. We also characterize the programs for which the maxima are attained. We obtain similar results for the class of all d...

The Stable Model Semantics for Logic Programming

Stable Model Counting and Its Application in Probabilistic Logic Programming

Model counting is the problem of computing the number of models that satisfy a given propositional theory. It has recently been applied to solving inference tasks in probabilistic logic programming, where the goal is to compute the probability of given queries being true provided a set of mutually independent random variables, a model (a logic program) and some evidence. The core of solving thi...

Towards a Formal Computation Model of Associative Logic Programming

The Logic Programming Paradigm in Numerical Computation

Although CLP(R) is a promising application of the logic programming paradigm to numerical computation, it has not addressed what has long been known as \the pitfalls of numerical] computation" 12]. These show that rounding errors induce a severe correctness problem wherever oating-point computation is used. Independently of logic programming, constraint processing has been applied to problems i...